Evaluating logic gate constraints in local search for structured satisfiability problems

Conjunctive normal forms (CNF) of structured satisfiability problems contain logic gate patterns. So Boolean circuits (BC) by and large can be obtained from them thus structural information that is lost in the CNF recovered. However, it not known which gates are useful for local search on BCs or particular help most why. In this article, we empirically show exploitation xor, xnor, eq, a key factor behind performance algorithms using single variable flips when adapted to constraints. Moreover, controlled experiments investigations into variables selected flipping further elucidates these findings. To achieve conclusions, have AdaptNovelty+ CCANr cope with gate-based constraint models. These two prominent families satisfiability. We performed our set benchmark instances SATLib, SAT2014, SAT2020. also presented techniques eliminate cycles among detected propagate equivalence statically through dependency relationships.